Propagating Differences: An Efficient New Fixpoint Algorithm for Distributive Constraint Systems
نویسندگان
چکیده
منابع مشابه
Nordic Journal of Computing PROPAGATING DIFFERENCES: AN EFFICIENT NEW FIXPOINT ALGORITHM FOR DISTRIBUTIVE CONSTRAINT SYSTEMS
Integrating semi-naive xpoint iteration from deductive data bases 3, 2, 4] as well as continuations into worklist-based solvers, we derive a new application independent local xpoint algorithm for distributive constraint systems. Seemingly diierent eecient algorithms for abstract interpretation like those for linear constant propagation for imperative languages 16] as well as for control-ow anal...
متن کاملPropagating Diierences: an Eecient New Fixpoint Algorithm for Distributive Constraint Systems
Integrating semi-naive xpoint iteration from deductive data bases 3, 2, 4] as well as continuations into worklist-based solvers, we derive a new application independent local xpoint algorithm for dis-tributive constraint systems. Seemingly diierent eecient algorithms for abstract interpretation like those for linear constant propagation for imperative languages 17] as well as for control-ow ana...
متن کاملAn Efficient Bi-objective Genetic Algorithm for the Single Batch-Processing Machine Scheduling Problem with Sequence Dependent Family Setup Time and Non-identical Job Sizes
This paper considers the problem of minimizing make-span and maximum tardiness simultaneously for scheduling jobs under non-identical job sizes, dynamic job arrivals, incompatible job families,and sequence-dependentfamily setup time on the single batch- processor, where split size of jobs is allowed between batches. At first, a new Mixed Integer Linear Programming (MILP) model is proposed for t...
متن کاملAn Efficient Genetic Algorithm for Task Scheduling on Heterogeneous Computing Systems Based on TRIZ
An efficient assignment and scheduling of tasks is one of the key elements in effective utilization of heterogeneous multiprocessor systems. The task scheduling problem has been proven to be NP-hard is the reason why we used meta-heuristic methods for finding a suboptimal schedule. In this paper we proposed a new approach using TRIZ (specially 40 inventive principles). The basic idea of thi...
متن کاملStrong polynomiality of resource constraint propagation
Constraint-based schedulers have been widely successful to tackle complex, disjunctive and cumulative, scheduling applications by combining tree search and constraint propagation. The constraint-propagation step is a fixpoint algorithm that applies pruning operators to tighten the release and due dates of activities using precedence or resource constraints. A variety of pruning operators for re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Universität Trier, Mathematik/Informatik, Forschungsbericht
دوره 97-13 شماره
صفحات -
تاریخ انتشار 1997